Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

A(a(c(x1))) → B(c(b(a(x1))))
B(x1) → C(d(x1))
A(a(c(x1))) → C(b(a(x1)))
B(a(c(d(x1)))) → A(a(x1))
A(a(c(x1))) → B(a(x1))
B(a(c(d(x1)))) → A(x1)
A(a(c(x1))) → A(x1)
B(a(c(d(x1)))) → A(a(a(x1)))
B(x1) → A(x1)

The TRS R consists of the following rules:

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(c(x1))) → B(c(b(a(x1))))
B(x1) → C(d(x1))
A(a(c(x1))) → C(b(a(x1)))
B(a(c(d(x1)))) → A(a(x1))
A(a(c(x1))) → B(a(x1))
B(a(c(d(x1)))) → A(x1)
A(a(c(x1))) → A(x1)
B(a(c(d(x1)))) → A(a(a(x1)))
B(x1) → A(x1)

The TRS R consists of the following rules:

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(c(x1))) → B(c(b(a(x1))))
B(a(c(d(x1)))) → A(a(x1))
A(a(c(x1))) → B(a(x1))
B(a(c(d(x1)))) → A(x1)
A(a(c(x1))) → A(x1)
B(a(c(d(x1)))) → A(a(a(x1)))
B(x1) → A(x1)

The TRS R consists of the following rules:

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(c(d(x1)))) → A(a(a(x1))) at position [0] we obtained the following new rules:

B(a(c(d(c(x0))))) → A(b(c(b(a(x0)))))
B(a(c(d(a(c(x0)))))) → A(a(b(c(b(a(x0))))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(a(c(x1))) → B(c(b(a(x1))))
A(a(c(x1))) → B(a(x1))
B(a(c(d(x1)))) → A(a(x1))
B(a(c(d(c(x0))))) → A(b(c(b(a(x0)))))
B(a(c(d(x1)))) → A(x1)
B(a(c(d(a(c(x0)))))) → A(a(b(c(b(a(x0))))))
A(a(c(x1))) → A(x1)
B(x1) → A(x1)

The TRS R consists of the following rules:

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))
A(a(c(x1))) → B(c(b(a(x1))))
A(a(c(x1))) → B(a(x1))
B(a(c(d(x1)))) → A(a(x1))
B(a(c(d(c(x0))))) → A(b(c(b(a(x0)))))
B(a(c(d(x1)))) → A(x1)
B(a(c(d(a(c(x0)))))) → A(a(b(c(b(a(x0))))))
A(a(c(x1))) → A(x1)
B(x1) → A(x1)

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))
A(a(c(x1))) → B(c(b(a(x1))))
A(a(c(x1))) → B(a(x1))
B(a(c(d(x1)))) → A(a(x1))
B(a(c(d(c(x0))))) → A(b(c(b(a(x0)))))
B(a(c(d(x1)))) → A(x1)
B(a(c(d(a(c(x0)))))) → A(a(b(c(b(a(x0))))))
A(a(c(x1))) → A(x1)
B(x1) → A(x1)

The set Q is empty.
We have obtained the following QTRS:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

C(a(A(x))) → C(B(x))
B1(x) → C(x)
C(a(A(x))) → B1(c(B(x)))
C(a(a(x))) → C(b(x))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
B1(x) → D(c(x))
B1(x) → D(x)
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(a(A(x))) → B2(x)
C(d(c(a(B(x))))) → C(b(A(x)))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(d(c(a(B(x))))) → B1(A(x))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(A(x))) → C(B(x))
B1(x) → C(x)
C(a(A(x))) → B1(c(B(x)))
C(a(a(x))) → C(b(x))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
B1(x) → D(c(x))
B1(x) → D(x)
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(a(A(x))) → B2(x)
C(d(c(a(B(x))))) → C(b(A(x)))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(d(c(a(B(x))))) → B1(A(x))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(A(x))) → C(B(x))
C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(d(c(a(B(x))))) → C(b(A(x)))
C(a(a(x))) → C(b(x))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(d(c(a(B(x))))) → B1(A(x))
C(a(a(x))) → B1(x)

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(A(x))) → C(B(x)) at position [0] we obtained the following new rules:

C(a(A(x0))) → C(A(x0))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B1(x) → C(x)
C(a(A(x))) → B1(c(B(x)))
C(a(a(x))) → C(b(x))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(A(x0))) → C(A(x0))
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(d(c(a(B(x))))) → C(b(A(x)))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(d(c(a(B(x))))) → B1(A(x))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(d(c(a(B(x))))) → C(b(A(x)))
C(a(a(x))) → C(b(x))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(d(c(a(B(x))))) → B1(A(x))
C(a(a(x))) → B1(x)

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(a(x))) → C(b(x)) at position [0] we obtained the following new rules:

C(a(a(x0))) → C(d(c(x0)))
C(a(a(x0))) → C(a(d(x0)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(a(x0))) → C(a(d(x0)))
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(d(c(a(B(x))))) → C(b(A(x)))
C(a(a(x))) → B1(c(b(x)))
C(d(c(a(B(x))))) → B1(A(x))
C(a(a(x))) → B1(x)

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(d(c(a(B(x))))) → C(b(A(x))) at position [0] we obtained the following new rules:

C(d(c(a(B(y0))))) → C(d(c(A(y0))))
C(d(c(a(B(y0))))) → C(a(d(A(y0))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(d(c(a(B(y0))))) → C(d(c(A(y0))))
B1(x) → C(x)
C(a(A(x))) → B1(c(B(x)))
C(a(a(x0))) → C(d(c(x0)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(a(x0))) → C(a(d(x0)))
C(d(c(a(B(y0))))) → C(a(d(A(y0))))
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(d(c(a(B(x))))) → B1(A(x))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(d(c(a(B(y0))))) → C(d(c(A(y0))))
C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(d(c(a(B(x)))))) → C(b(a(A(x))))
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(d(c(a(B(x))))) → B1(A(x))
C(a(a(x))) → B1(x)
C(a(a(x0))) → C(a(d(x0)))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(d(c(a(B(x)))))) → C(b(a(A(x)))) at position [0] we obtained the following new rules:

C(a(d(c(a(B(y0)))))) → C(d(c(a(A(y0)))))
C(a(d(c(a(B(y0)))))) → C(a(d(a(A(y0)))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(d(c(a(B(y0))))) → C(d(c(A(y0))))
B1(x) → C(x)
C(a(A(x))) → B1(c(B(x)))
C(a(d(c(a(B(y0)))))) → C(d(c(a(A(y0)))))
C(a(a(x0))) → C(d(c(x0)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(a(x0))) → C(a(d(x0)))
C(a(d(c(a(B(y0)))))) → C(a(d(a(A(y0)))))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(d(c(a(B(x))))) → B1(A(x))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(d(c(a(B(y0))))) → C(d(c(A(y0))))
C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(d(c(a(B(y0)))))) → C(d(c(a(A(y0)))))
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(d(c(a(B(x))))) → B1(A(x))
C(a(a(x))) → B1(x)
C(a(a(x0))) → C(a(d(x0)))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(d(c(a(B(y0)))))) → C(d(c(a(A(y0))))) at position [0] we obtained the following new rules:

C(a(d(c(a(B(x0)))))) → C(d(a(B(x0))))
C(a(d(c(a(B(y0)))))) → C(d(a(A(y0))))
C(a(d(c(a(B(x0)))))) → C(d(A(x0)))
C(a(d(c(a(B(x0)))))) → C(d(a(b(c(B(x0))))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(d(c(a(B(y0))))) → C(d(c(A(y0))))
B1(x) → C(x)
C(a(A(x))) → B1(c(B(x)))
C(a(d(c(a(B(x0)))))) → C(d(A(x0)))
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x0)))))) → C(d(a(B(x0))))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(a(x0))) → C(a(d(x0)))
C(a(d(c(a(B(x0)))))) → C(d(a(b(c(B(x0))))))
C(a(d(c(a(B(y0)))))) → C(d(a(A(y0))))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(d(c(a(B(x))))) → B1(A(x))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 4 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(d(c(a(B(y0))))) → C(d(c(A(y0))))
C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(d(c(a(B(x))))) → B1(A(x))
C(a(a(x))) → B1(x)
C(a(a(x0))) → C(a(d(x0)))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(d(c(a(B(y0))))) → C(d(c(A(y0)))) at position [0] we obtained the following new rules:

C(d(c(a(B(y0))))) → C(d(A(y0)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B1(x) → C(x)
C(a(A(x))) → B1(c(B(x)))
C(a(a(x0))) → C(d(c(x0)))
C(d(c(a(B(y0))))) → C(d(A(y0)))
C(a(a(x))) → B1(c(b(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(a(a(x))) → B1(x)
C(d(c(a(B(x))))) → B1(A(x))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(a(x0))) → C(a(d(x0)))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                          ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(d(c(a(B(x))))) → B1(A(x))
C(a(a(x))) → B1(x)
C(a(a(x0))) → C(a(d(x0)))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We found the following quasi-model for the rules of the TRS R. Interpretation over the domain with elements from 0 to 1.C: 0
c: 1
B: 0
a: 1
A: 0
B1: 0
d: 1
b: 1
By semantic labelling [33] we obtain the following labelled TRS:Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(a.1(x0))) → C.0(a.1(d.1(x0)))
C.1(a.1(a.1(x))) → B1.0(c.1(b.1(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.0(A.0(x))
C.1(a.1(a.1(x))) → B1.0(x)
C.1(a.0(A.1(x))) → B1.0(c.0(B.1(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.0(x0))) → C.1(d.1(c.0(x0)))
C.1(a.1(a.1(x0))) → C.0(d.1(c.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(a.1(a.0(x))) → B1.0(x)
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.1(a.0(x0))) → C.0(a.1(d.0(x0)))
C.1(a.0(A.0(x))) → B1.1(c.0(B.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.0(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(a.0(A.1(x)))
B1.1(x) → C.0(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(a.1(a.0(x))) → B1.0(c.1(b.0(x)))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(d.1(c.1(a.0(B.1(x))))) → B1.0(A.1(x))
C.1(a.0(A.0(x))) → B1.0(c.0(B.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(a.0(A.0(x)))
B1.1(x) → C.1(x)
C.1(a.0(A.1(x))) → B1.1(c.0(B.1(x)))
B1.0(x) → C.0(x)
C.1(a.1(a.0(x0))) → C.0(d.1(c.0(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.0(c.1(b.0(A.1(x))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

b.0(x) → d.1(c.0(x))
A.1(x0) → A.0(x0)
c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.1(b.1(c.0(B.1(x))))
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
b.1(x) → d.1(c.1(x))
B.1(x0) → B.0(x0)
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))
c.1(a.0(A.0(x))) → a.1(b.1(c.0(B.0(x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                            ↳ QDP
                                                                              ↳ DependencyGraphProof
                                                                          ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(a.1(x0))) → C.0(a.1(d.1(x0)))
C.1(a.1(a.1(x))) → B1.0(c.1(b.1(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.0(A.0(x))
C.1(a.1(a.1(x))) → B1.0(x)
C.1(a.0(A.1(x))) → B1.0(c.0(B.1(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.0(x0))) → C.1(d.1(c.0(x0)))
C.1(a.1(a.1(x0))) → C.0(d.1(c.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(a.1(a.0(x))) → B1.0(x)
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.1(a.0(x0))) → C.0(a.1(d.0(x0)))
C.1(a.0(A.0(x))) → B1.1(c.0(B.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.0(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(a.0(A.1(x)))
B1.1(x) → C.0(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(a.1(a.0(x))) → B1.0(c.1(b.0(x)))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(d.1(c.1(a.0(B.1(x))))) → B1.0(A.1(x))
C.1(a.0(A.0(x))) → B1.0(c.0(B.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(a.0(A.0(x)))
B1.1(x) → C.1(x)
C.1(a.0(A.1(x))) → B1.1(c.0(B.1(x)))
B1.0(x) → C.0(x)
C.1(a.1(a.0(x0))) → C.0(d.1(c.0(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.0(c.1(b.0(A.1(x))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

b.0(x) → d.1(c.0(x))
A.1(x0) → A.0(x0)
c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.1(b.1(c.0(B.1(x))))
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
b.1(x) → d.1(c.1(x))
B.1(x0) → B.0(x0)
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))
c.1(a.0(A.0(x))) → a.1(b.1(c.0(B.0(x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 20 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                            ↳ QDP
                                                                              ↳ DependencyGraphProof
                                                                                ↳ QDP
                                                                                  ↳ RuleRemovalProof
                                                                          ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(a.0(x0))) → C.1(d.1(c.0(x0)))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
B1.1(x) → C.1(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.0(A.1(x))) → B1.1(c.0(B.1(x)))
C.1(a.0(A.0(x))) → B1.1(c.0(B.0(x)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

b.0(x) → d.1(c.0(x))
A.1(x0) → A.0(x0)
c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.1(b.1(c.0(B.1(x))))
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
b.1(x) → d.1(c.1(x))
B.1(x0) → B.0(x0)
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))
c.1(a.0(A.0(x))) → a.1(b.1(c.0(B.0(x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.

Strictly oriented rules of the TRS R:

A.1(x0) → A.0(x0)
B.1(x0) → B.0(x0)

Used ordering: POLO with Polynomial interpretation [25]:

POL(A.0(x1)) = x1   
POL(A.1(x1)) = 1 + x1   
POL(B.0(x1)) = x1   
POL(B.1(x1)) = 1 + x1   
POL(B1.1(x1)) = x1   
POL(C.1(x1)) = x1   
POL(a.0(x1)) = x1   
POL(a.1(x1)) = x1   
POL(b.0(x1)) = x1   
POL(b.1(x1)) = x1   
POL(c.0(x1)) = x1   
POL(c.1(x1)) = x1   
POL(d.0(x1)) = x1   
POL(d.1(x1)) = x1   



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                            ↳ QDP
                                                                              ↳ DependencyGraphProof
                                                                                ↳ QDP
                                                                                  ↳ RuleRemovalProof
                                                                                    ↳ QDP
                                                                          ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(a.0(x0))) → C.1(d.1(c.0(x0)))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
B1.1(x) → C.1(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.0(A.1(x))) → B1.1(c.0(B.1(x)))
C.1(a.0(A.0(x))) → B1.1(c.0(B.0(x)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

b.0(x) → d.1(c.0(x))
c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.1(b.1(c.0(B.1(x))))
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
b.1(x) → d.1(c.1(x))
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))
c.1(a.0(A.0(x))) → a.1(b.1(c.0(B.0(x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
As can be seen after transforming the QDP problem by semantic labelling [33] and then some rule deleting processors, only certain labelled rules and pairs can be used. Hence, we only have to consider all unlabelled pairs and rules (without the decreasing rules for quasi-models).

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                          ↳ SemLabProof2
                                                                            ↳ QDP
                                                                              ↳ SemLabProof
                                                                              ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(A(x))) → B1(c(B(x)))
B1(x) → C(x)
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(a(x0))) → C(a(d(x0)))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We found the following quasi-model for the rules of the TRS R. Interpretation over the domain with elements from 0 to 1.C: 0
c: x0
B: 0
a: 1
A: 0
B1: 0
d: 1
b: 1
By semantic labelling [33] we obtain the following labelled TRS:Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(a.0(x0))) → C.1(d.0(c.0(x0)))
C.1(a.1(a.1(x0))) → C.0(a.1(d.1(x0)))
C.1(a.1(a.1(x))) → B1.0(c.1(b.1(x)))
C.1(a.1(a.1(x))) → B1.0(x)
C.1(a.0(A.1(x))) → B1.0(c.0(B.1(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.1(x0))) → C.0(d.1(c.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(a.1(a.0(x))) → B1.0(x)
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.1(a.0(x0))) → C.0(a.1(d.0(x0)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.0(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(a.0(A.1(x)))
B1.1(x) → C.0(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(a.1(a.0(x))) → B1.0(c.1(b.0(x)))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(a.0(x0))) → C.0(d.0(c.0(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(a.0(A.0(x))) → B1.0(c.0(B.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(a.0(A.0(x)))
B1.1(x) → C.1(x)
B1.0(x) → C.0(x)
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.0(c.1(b.0(A.1(x))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)
c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
c.1(a.0(A.0(x))) → a.1(b.0(c.0(B.0(x))))
b.1(x) → d.1(c.1(x))
B.1(x0) → B.0(x0)
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
b.0(x) → d.0(c.0(x))
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
c.1(a.0(A.1(x))) → a.1(b.0(c.0(B.1(x))))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                          ↳ SemLabProof2
                                                                            ↳ QDP
                                                                              ↳ SemLabProof
                                                                                ↳ QDP
                                                                                  ↳ DependencyGraphProof
                                                                              ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(a.0(x0))) → C.1(d.0(c.0(x0)))
C.1(a.1(a.1(x0))) → C.0(a.1(d.1(x0)))
C.1(a.1(a.1(x))) → B1.0(c.1(b.1(x)))
C.1(a.1(a.1(x))) → B1.0(x)
C.1(a.0(A.1(x))) → B1.0(c.0(B.1(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.1(x0))) → C.0(d.1(c.1(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(a.1(a.0(x))) → B1.0(x)
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.1(a.0(x0))) → C.0(a.1(d.0(x0)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.0(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.0(a.0(A.1(x)))
B1.1(x) → C.0(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(a.1(a.0(x))) → B1.0(c.1(b.0(x)))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(a.0(x0))) → C.0(d.0(c.0(x0)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(a.0(A.0(x))) → B1.0(c.0(B.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.0(a.0(A.0(x)))
B1.1(x) → C.1(x)
B1.0(x) → C.0(x)
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.0(c.1(b.0(A.1(x))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)
c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
c.1(a.0(A.0(x))) → a.1(b.0(c.0(B.0(x))))
b.1(x) → d.1(c.1(x))
B.1(x0) → B.0(x0)
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
b.0(x) → d.0(c.0(x))
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
c.1(a.0(A.1(x))) → a.1(b.0(c.0(B.1(x))))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 19 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                          ↳ SemLabProof2
                                                                            ↳ QDP
                                                                              ↳ SemLabProof
                                                                                ↳ QDP
                                                                                  ↳ DependencyGraphProof
                                                                                    ↳ QDP
                                                                                      ↳ RuleRemovalProof
                                                                              ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
B1.1(x) → C.1(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

A.1(x0) → A.0(x0)
c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
c.1(a.0(A.0(x))) → a.1(b.0(c.0(B.0(x))))
b.1(x) → d.1(c.1(x))
B.1(x0) → B.0(x0)
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
b.0(x) → d.0(c.0(x))
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
c.1(a.0(A.1(x))) → a.1(b.0(c.0(B.1(x))))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.

Strictly oriented rules of the TRS R:

A.1(x0) → A.0(x0)
B.1(x0) → B.0(x0)

Used ordering: POLO with Polynomial interpretation [25]:

POL(A.0(x1)) = x1   
POL(A.1(x1)) = 1 + x1   
POL(B.0(x1)) = x1   
POL(B.1(x1)) = 1 + x1   
POL(B1.1(x1)) = x1   
POL(C.1(x1)) = x1   
POL(a.0(x1)) = x1   
POL(a.1(x1)) = x1   
POL(b.0(x1)) = x1   
POL(b.1(x1)) = x1   
POL(c.0(x1)) = x1   
POL(c.1(x1)) = x1   
POL(d.0(x1)) = x1   
POL(d.1(x1)) = x1   



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                          ↳ SemLabProof2
                                                                            ↳ QDP
                                                                              ↳ SemLabProof
                                                                                ↳ QDP
                                                                                  ↳ DependencyGraphProof
                                                                                    ↳ QDP
                                                                                      ↳ RuleRemovalProof
                                                                                        ↳ QDP
                                                                              ↳ SemLabProof2
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(c.1(b.1(a.0(A.1(x)))))
C.1(a.1(a.1(x0))) → C.1(d.1(c.1(x0)))
C.1(a.1(a.0(x))) → B1.1(c.1(b.0(x)))
C.1(d.1(c.1(a.0(B.1(x))))) → B1.1(c.1(b.0(A.1(x))))
C.1(a.1(a.1(x0))) → C.1(a.1(d.1(x0)))
C.1(a.1(a.1(x))) → B1.1(x)
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(a.0(A.0(x)))
C.1(d.1(c.1(a.0(B.0(x))))) → B1.1(c.1(b.0(A.0(x))))
C.1(a.1(a.1(x))) → B1.1(c.1(b.1(x)))
B1.1(x) → C.1(x)
C.1(a.1(d.1(c.1(a.0(B.1(x)))))) → B1.1(a.0(A.1(x)))
C.1(a.1(d.1(c.1(a.0(B.0(x)))))) → B1.1(c.1(b.1(a.0(A.0(x)))))
C.1(a.1(a.0(x0))) → C.1(a.1(d.0(x0)))

The TRS R consists of the following rules:

c.1(x) → x
B.0(x) → A.0(x)
d.1(c.1(a.0(B.1(x)))) → a.0(A.1(x))
c.1(a.0(A.1(x))) → A.1(x)
d.1(c.1(a.0(B.0(x)))) → a.0(A.0(x))
b.1(x0) → b.0(x0)
c.1(a.0(A.1(x))) → a.0(B.1(x))
a.1(x0) → a.0(x0)
c.1(a.0(A.0(x))) → a.1(b.0(c.0(B.0(x))))
b.1(x) → d.1(c.1(x))
d.1(c.1(a.1(b.1(x)))) → a.1(a.1(a.1(x)))
c.1(a.1(d.1(c.1(a.0(B.1(x)))))) → a.1(b.1(c.1(b.1(a.0(A.1(x))))))
c.1(d.1(c.1(a.0(B.1(x))))) → a.1(b.1(c.1(b.0(A.1(x)))))
d.1(x0) → d.0(x0)
b.0(x) → d.0(c.0(x))
c.0(x) → x
c.1(x0) → c.0(x0)
c.1(a.1(a.1(x))) → a.1(b.1(c.1(b.1(x))))
d.1(c.1(a.0(B.0(x)))) → A.0(x)
d.1(c.1(a.1(b.0(x)))) → a.1(a.1(a.0(x)))
d.1(c.1(a.0(B.1(x)))) → A.1(x)
c.1(a.1(a.0(x))) → a.1(b.1(c.1(b.0(x))))
c.1(d.1(c.1(a.0(B.0(x))))) → a.1(b.1(c.1(b.0(A.0(x)))))
c.1(a.0(A.0(x))) → A.0(x)
b.0(x) → a.1(d.0(x))
c.1(a.0(A.1(x))) → a.1(b.0(c.0(B.1(x))))
B.1(x) → A.1(x)
c.1(a.0(A.0(x))) → a.0(B.0(x))
b.1(x) → a.1(d.1(x))
c.1(a.1(d.1(c.1(a.0(B.0(x)))))) → a.1(b.1(c.1(b.1(a.0(A.0(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
As can be seen after transforming the QDP problem by semantic labelling [33] and then some rule deleting processors, only certain labelled rules and pairs can be used. Hence, we only have to consider all unlabelled pairs and rules (without the decreasing rules for quasi-models).

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ Narrowing
            ↳ QDP
              ↳ QDPToSRSProof
                ↳ QTRS
                  ↳ QTRS Reverse
                    ↳ QTRS
                      ↳ DependencyPairsProof
                        ↳ QDP
                          ↳ DependencyGraphProof
                            ↳ QDP
                              ↳ Narrowing
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ Narrowing
                                            ↳ QDP
                                              ↳ DependencyGraphProof
                                                ↳ QDP
                                                  ↳ Narrowing
                                                    ↳ QDP
                                                      ↳ DependencyGraphProof
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ DependencyGraphProof
                                                                ↳ QDP
                                                                  ↳ Narrowing
                                                                    ↳ QDP
                                                                      ↳ DependencyGraphProof
                                                                        ↳ QDP
                                                                          ↳ SemLabProof
                                                                          ↳ SemLabProof2
                                                                            ↳ QDP
                                                                              ↳ SemLabProof
                                                                              ↳ SemLabProof2
                                                                                ↳ QDP
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

B1(x) → C(x)
C(a(a(x0))) → C(d(c(x0)))
C(a(d(c(a(B(x)))))) → B1(a(A(x)))
C(d(c(a(B(x))))) → B1(c(b(A(x))))
C(a(a(x))) → B1(c(b(x)))
C(a(a(x))) → B1(x)
C(a(d(c(a(B(x)))))) → B1(c(b(a(A(x)))))
C(a(a(x0))) → C(a(d(x0)))

The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))
c(a(A(x))) → a(b(c(B(x))))
c(a(A(x))) → a(B(x))
d(c(a(B(x)))) → a(A(x))
c(d(c(a(B(x))))) → a(b(c(b(A(x)))))
d(c(a(B(x)))) → A(x)
c(a(d(c(a(B(x)))))) → a(b(c(b(a(A(x))))))
c(a(A(x))) → A(x)
B(x) → A(x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

The set Q is empty.
We have obtained the following QTRS:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
    ↳ QTRS
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(a(c(x1))) → b(c(b(a(x1))))
b(x1) → d(a(x1))
b(a(c(d(x1)))) → a(a(a(x1)))
c(x1) → x1
b(x1) → c(d(x1))

The set Q is empty.
We have obtained the following QTRS:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse
    ↳ QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

c(a(a(x))) → a(b(c(b(x))))
b(x) → a(d(x))
d(c(a(b(x)))) → a(a(a(x)))
c(x) → x
b(x) → d(c(x))

Q is empty.